HASHING WITH POLYNOMIALS
نویسندگان
چکیده
منابع مشابه
Hashing with Polynomials
In this paper, we explore potential mathematical principles and structures that can provide the foundation for cryptographic hash functions, and also present a simple and efficiently computable hash function based on a non-associative operation with polynomials over a finite field of characteristic 2.
متن کاملMultivariates Polynomials for Hashing
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security properties and potential feasibility, where the compression functions are randomly chosen highdegree polynomials, and show that under some plausible assumptions, high-degree polynomials as compression functions has good...
متن کاملPreimage Attack on Hashing with Polynomials proposed at ICISC'06
In this paper, we suggest a preimage attack on Hashing with Polynomials [2]. The algorithm has n-bit hash output and n-bit intermediate state. (for example, n = 163). The algorithm is very simple and light so that it can be implement in low memory environment. Our attack is based on the meet-in-the-middle attack. We show that we can find a preimage with the time complexity 2 + 2 ∗ (n+1/33) and ...
متن کاملSecurity Analysis of Multivariate Polynomials for Hashing
In this paper, we investigate the security of a hash function based on the evaluation of multivariate polynomials [17]. The security of such hash function is related to the difficulty of solving (under-defined) systems of algebraic equations. To solve these systems, we have used a general hybrid approach [8] mixing exhaustive search and Gröbner bases solving. This shows that this approach is ge...
متن کاملDouble hashing with passbits
Double hashing with bucket capacity one is augmented with multiple passbits to obtain significant reduction to unsiccessful search lengths. This improves the analysis of Martini et al.[3] by providing a closed form expression for the expected unsuccessful search lengths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics, Mechanics and Computer Science
سال: 2020
ISSN: 1563-0277,2617-4871
DOI: 10.26577/jmmcs.2020.v107.i3.08